An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing
نویسندگان
چکیده
Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [4] to provide delegation of decryption rights. PRE allows re-encryption of a ciphertext intended for Alice (delegator) to a ciphertext for Bob (delegatee) via a semi-honest proxy, who should not learn anything about the underlying message. In 2003, Al-Riyami and Patterson introduced the notion of certificateless public key cryptography which offers the advantage of identity-based cryptography without suffering from the key escrow problem. The existing certificateless PRE (CLPRE) schemes rely on costly bilinear pairing operations. In ACM ASIA-CCS SCC 2015, Srinivasan et al. proposed the first construction of a certificateless PRE scheme without resorting to pairing in the random oracle model. However, in this work, we demonstrate a flaw in the CCA-security proof of their scheme. Also, we present the first construction of a CLPRE scheme without pairing which meets CCA security under the computational Diffie-Hellman hardness assumption in the random oracle model.
منابع مشابه
On the security of a Certificateless Proxy Re-Encryption Scheme without Pairing
Proxy re-encryption (PRE) is a cryptographic primitive introduced by Blaze, Bleumer and Strauss [2] to provide delegation of decryption rights. A semi-trusted proxy agent re-encrypts ciphertexts under the public key of Alice into ciphertexts under the public key of Bob, without learning anything about the underlying message. In IWSEC 2017, Kuchta et al. presented a pairing-free certificateless ...
متن کاملChosen-Ciphertext Secure Certificateless Proxy Re-Encryption
In this paper we introduce the notion of certificateless proxy re-encryption and also give precise definitions for secure certificateless proxy re-encryption schemes. We present a concrete scheme based on bilinear pairing, which enjoys the advantages of certificateless public key cryptography while providing the functionalities of proxy re-encryption. Moreover, the proposed scheme is unidirecti...
متن کاملAn Efficient Confidentiality Preserving Scheme Using Certificateless Encryption with High Trust Level
Certificateless public key cryptography with bilinear pairing needs costly operations, which is not appropriate for a practical application. In this paper, we present a certificateless public key encryption scheme without bilinear pairing. This encryption scheme achieves Girault’s trust Level 3 as in traditional public key infrastructure based cryptography, and which is proved to be secure in t...
متن کاملCCA Secure Publicly Verifiable Public Key Encryption Without Pairings Nor Random Oracle and Its Applications
hosen ciphertext security (CCA security)hosen ciphertext security (CCA security)C is now a widely accepted necessary security notion for public key encryption. CCA secure public verifiable public key encryption has many applications such as threshold public key encryption and proxy re-encryption etc. Furthermore, these years “random oracle model” has seen risen criticize by many cryptographers....
متن کاملConstructing Efficient Certificateless Public Key Encryption with Pairing
Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic series construction model of certificateless public key encryption (CL-PKE). However, this model pays much attention on the generic construction and neglects the properties of the pairings. In this paper we propose a CL-P...
متن کامل